Subgraphs with Large Minimum $\ell$-Degree in Hypergraphs where Almost All $\ell$-Degrees are Large
نویسندگان
چکیده
منابع مشابه
Large Induced Subgraphs with All Degrees Odd
We prove that every connected graph of order n ≥ 2 has an induced subgraph with all degrees odd of order at least cn/ log n, where c is a constant. We also give a bound in terms of chromatic number, and resolve the analogous problem for random graphs.
متن کاملMatchings in hypergraphs of large minimum degree
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for hypergraphs. We also prove several related results which guarantee the existence of almost perfect matchings in r-uniform hypergraphs of large minimum degree. Our bounds on the minimum degree are essentially best poss...
متن کاملPerfect matchings in uniform hypergraphs with large minimum degree
A perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/k disjoint edges. In this paper we give a sufficient condition for the existence of a perfect matching in terms of a variant of the minimum degree. We prove that for every k ≥ 3 and sufficiently large n, a perfect matching exists in every n-vertex k-uniform hypergraph in which each set of k − 1 vertices ...
متن کاملExistence of Spanning ℱ-Free Subgraphs with Large Minimum Degree
Let F be a family of graphs and let d be large enough. For every d-regular graph G, we study the existence of a spanning F -free subgraph of G with large minimum degree. This problem is wellunderstood if F does not contain bipartite graphs. Here we provide asymptotically tight results for many families of bipartite graphs such as cycles or complete bipartite graphs. To prove these results, we s...
متن کاملGraphs with unavoidable subgraphs with large degrees
Let `,(n, m) denote the class of simple graphs on n vertices and m edges and let G C `6(n, m) . There are many results in graph theory giving conditions under which G contains certain types of subgraphs, such as cycles of given lengths, complete graphs, etc . For example, Turan's theorem gives a sufficient condition for G to contain a K,,„ in terms of the number of edges in G . In this paper we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/6553